#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <unordered_map>

using namespace std;
using LL = long long;

/*
Let's denote A as the set of these m·k largest elements. The solution for us will be dividing the array into k segments, such that each segment contains exactly m elements of A. Just make a split between corresponding elements in the set A.
*/

bool cmp(int a, int b){
    return a > b;
}

int main(){
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    unordered_map<int, int> mp;
    vector<int> nums, temp;
    int n, m, k;
    LL res = 0;
    cin >> n >> m >> k;

    for(int i = 1, x; i <= n; i ++) {
        cin >> x;
        nums.push_back(x);
        temp.push_back(x);
    }

    sort(temp.begin(), temp.end(), cmp);

    // for(int i = 0; i < temp.size(); i ++) cout << temp[i] << " ";
    // cout << '\n';

    for(int i = 0; i < m * k; i ++){
        if(mp.count(temp[i])){
            mp[temp[i]] ++;
        }else{
            mp[temp[i]] = 1;
        }
        res = res + temp[i];
    }

    cout << res << endl;

    int cnt = 0, t = 0;
    for(int i = 0; i < nums.size(); i ++){
        if(mp[nums[i]]) cnt++, mp[nums[i]] --;
        if(cnt == m) {
            cout << i + 1 << " ";
            cnt = 0;
            t ++;
        }

        if(t == k - 1) break;   
    }



    return 0;
}